Combinatorial Interpretation of Kolmogorov Complexity
نویسندگان
چکیده
The very first Kolmogorov’s paper on algorithmic information theory [1] was entitled “Three approaches to the definition of the quantity of information”. These three approaches were called combinatorial, probabilistic and algorithmic. Trying to establish formal connections between combinatorial and algorithmic approaches, we prove that every linear inequality including Kolmogorov complexities could be translated into an equivalent combinatorial statement. Entropy (complexity) proofs of combinatorial inequalities given in [5] and [2] can be considered as a special cases (and a natural starting points) for this translation.
منابع مشابه
Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
Assume that for some α < 1 and for all nutural n a set Fn of at most 2 “forbidden” binary strings of length n is fixed. Then there exists an infinite binary sequence ω that does not have (long) forbidden substrings. We prove this combinatorial statement by translating it into a statement about Kolmogorov complexity and compare this proof with a combinatorial one based on Laslo Lovasz local lemm...
متن کاملComplicated Complementations
Kolmogorov complexity has proven to be a very useful tool in simplifying and improving proofs that use complicated combinatorial arguments. In this paper we use Kolmogorov complexity for oracle construction. We obtain separation results that are much stronger than separations obtained previously even with the use of very complicated combinatorial arguments. Moreover the use of Kolmogorov argume...
متن کاملKolmogorov Complexity Arguments in Combinatorics
The utility of a Kolmogorov complexity method in combinatorial theory is demonstrated by several examples.
متن کاملQuantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks
Two-party one-way quantum communication has been extensively studied in the recent literature. We target the size of minimal information that is necessary for a feasible party to finish a given combinatorial task, such as distinction of instances, using one-way communication from another party. This type of complexity measure has been studied under various names: advice complexity, Kolmogorov c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000